primal dual algorithm

On the Research of Primal-dual Infeasible Interior Point Algorithm for Box Linear Programming

框式线性规划的原始&对偶不可行内点算法的进一步研究

A primal-dual inexact infeasible interior-point algorithm for the second-order cone program ( SOCP ) was presented.

摘要给出了二次锥规划的一种 非 精确不可行内点算法.

A primal-dual inexact infeasible-interior-point algorithm is presented for solving the second-order cone programming problems.

给出一种求解二次锥规划问题的原 - 对偶非精确不可行内点算法.

Primal-dual predictor-corrector interior-point algorithm is presented to solve SDP problems in these fields.

为了更好地求解这些领域中遇到的半定规划问题,给出了半定规划的原始对偶预估校正内点算法.

Study on optimal power flow based on primal-dual interior point algorithm under perturbed KKT conditions and branch-and-bound method

基于扰动KKT条件的原始-对偶内点法和分支定界法的最优潮流研究